| 1. | This paper presents an efficient algorithm for polygon clipping which processes general polygons
本文提出一个多边形裁剪多边形的有效算法，其中的多边形均可以是一般多边形。 |
| 2. | Polygon clipping is more often used than line clipping in practice , so it is the main subject in clipping research now
多边形裁剪与线剪裁相比具有更广泛的实用意义，因此它是目前裁剪研究的主要课题。 |
| 3. | This paper puts forward an efficient algorithm for polygon clipping , and it is suitable for not only concave polygon but also the polygon with hole in it
本文提出了一个有效的多边形裁剪算法，它不仅适用于凹多边形而且适用于带孔洞的多边形。 |
| 4. | In addition , it suits for the case in which polygon clipping turns out a lot of discrete consequential polygons , so this algorithm is general to all kinds of polygon
另外，还适用于有多个分立的结果多边形( consequentialpolygon )的情况，具有一般性。 |
| 5. | During practical research , comparing with line clipping , polygon clipping has high rate of utilization , so it is the main subjects of clipping studied at present
在实际运用中，多边形裁剪与线裁剪相比具有更高的使用率，因此它是目前裁剪研究的主要课题。 |
| 6. | At one time the second encoding technology is developed from retangle window to circle window , from line clipping to polygon clipping and from 2 - d clipping to 3 - d clipping
把二次编码技术由矩形窗口深入拓展到圆形窗口，由线裁剪拓展到多边形裁剪，以及从二维窗口深入到三维窗口。 |
| 7. | This paper researches the basic algorithms of computer graphics including the algorithms of an efficient algorithm for polygon clipping and pixel - level algorithm for generating archimedes and ivolute curve
本文的工作是对计算机图形学中的基础算法进行研究。包括一个有效的多边形裁剪算法，以及阿基米德曲线及圆的渐开线的逐点生成算法。 |
| 8. | The discrete optimization of boundary curve and the optimization of polygon clipping are discussed on the basis of the above research , this surface automatic mesh generation have applied to cae software successfully which can create high quality element . the method is steady and reliable . the speeding of the meshing is good
在上述技术研究的基础上,将曲面自动网格划分算法成功应用于板料成形模拟的cae软件中,该算法具有自适应能力强,网格生成速度快,稳定可靠等优点。 |
| 9. | By constructing the list of vertices of polygon and intersecting points between polygon and rectangle , the list of vertices of rectangle and between polygon and rectangle , the list of incoming points and the list of outcoming points , the problem that how to confirm close clipped area edge is solved . at the same time , the second encoding technology is developed from line clipping to polygon clipping so that the speed of algorithm is increased
矩形窗口多边形裁剪的改进算法通过引入多交表、矩交表、入点表、出点表等线性链表，解决了如何确定一般多边形在矩形窗口裁剪后封闭区域边界问题，并把二次编码技术由线裁剪拓展到多边形裁剪中，对处于窗外的多边形的边可直接处理，提高了算法的效率。 |
